Finding overlapping communities based on Markov chain and link clustering
نویسندگان
چکیده
منابع مشابه
Detecting Overlapping Communities Based on Link-link Similarity and SNMF
In this paper, we present a method named OCDLS that is based on link-link similarity and SNMF (symmetric nonnegative matrix factorization) to detect overlapping communities. To begin with constructing the link-link similarity matrix, and then using SNMF to partition links, finally computing the overlapping factor, and assigning nodes to the corresponding communities according to the prespecifie...
متن کاملFinding communities by clustering a graph into overlapping subgraphs
We present a new approach to the problem of finding communities: a community is a subset of actors who induce a locally optimal subgraph with respect to a density function defined on subsets of actors. Two different subsets with significant overlap can both be locally optimal, and in this way we may obtain overlapping communities. We design, implement, and test two novel efficient algorithms, R...
متن کاملDetecting Overlapping Link Communities
We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results ...
متن کاملOverlapping Communities Detection based on Link Partition in Directed Networks
Many complex systems can be described as networks to comprehend both the structure and the function. Community structure is one of the most important properties of complex networks. Detecting overlapping communities in networks have been more attention in recent years, but the most of approaches to this problem have been applied to the undirected networks. This paper presents a novel approach b...
متن کاملLine graphs, link partitions, and overlapping communities.
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm that produces a partition of nodes can be used to produce a partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Peer-to-Peer Networking and Applications
سال: 2016
ISSN: 1936-6442,1936-6450
DOI: 10.1007/s12083-016-0457-0